Discrete Fourier Transform-based Engine Misfire Detection
نویسندگان
چکیده
منابع مشابه
Online Botnet Detection Based on Incremental Discrete Fourier Transform
Botnet detection has attracted lots of attention since botnet attack is becoming one of the most serious threats on the Internet. But little work has considered the online detection. In this paper, we propose a novel approach that can monitor the botnet activities in an online way. We define the concept of “feature streams” to describe raw network traffic. If some feature streams show high simi...
متن کاملDetection of high impedance faults in distribution networks using Discrete Fourier Transform
In this paper, a new method for extracting dynamic properties for High Impedance Fault (HIF) detection using discrete Fourier transform (DFT) is proposed. Unlike conventional methods that use features extracted from data windows after fault to detect high impedance fault, in the proposed method, using the disturbance detection algorithm in the network, the normalized changes of the selected fea...
متن کامل3D Fourier based discrete Radon transform
The Radon transform is a fundamental tool in many areas. For example, in reconstruction of an image from its projections (CT scanning). Recently A. Averbuch et al. [SIAM J. Sci. Comput., submitted for publication] developed a coherent discrete definition of the 2D discrete Radon transform for 2D discrete images. The definition in [SIAM J. Sci. Comput., submitted for publication] is shown to be ...
متن کاملDft : Discrete Fourier Transform
A. Table of contents by sections: 1. Abstract (you’re reading this now) 2. Summary of the DFT (How do I do the homework?) 3. Review of continuous-time Fourier series 4. Bandlimited signals and finite Fourier series 5. Sampling theorem for periodic signals 6. Review of quirks of discrete-time frequency 7. Orthogonality and its significance 8. Discrete Fourier Transform (DFT) 9. Use of DFT to com...
متن کاملThe Discrete Fourier Transform∗
1 Motivation We want to numerically approximate coefficients in a Fourier series. The first step is to see how the trapezoidal rule applies when numerically computing the integral (2π) −1 2π 0 F (t)dt, where F (t) is a continuous, 2π-periodic function. Applying the trapezoidal rule with the stepsize taken to be h = 2π/n for some integer n ≥ 1 results in (2π) −1 2π 0 F (t)dt ≈ 1 n n−1 j=0 Y j , ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transaction of the Korean Society of Automotive Engineers
سال: 2021
ISSN: 1225-6382,2234-0149
DOI: 10.7467/ksae.2021.29.5.407